A Feedback-Controlled EDF Scheduling Algorithm for Real- time Multimedia Transmission
نویسندگان
چکیده
Real-time communication is important for time-critical multimedia applications. However, conventional real-time schedulers such as EDF (Earliest Deadline First) and RM (Rate Monotonic) are designed for task sets with sophisticated characteristics. They can perform well in the idea network with precise workloads. But, in a realistic network with shared bandwidth and unpredictable workloads, their performances may be poor. In this paper, a control-theoretical approach of EDF called BC-EDF (Buffer-Controlled EDF) is proposed to resolve the real-time scheduling problem in multimedia communications. Based on the feedback control ideas (that have been used successfully in systems with unpredictable workloads), BC-EDF utilizes the feedback of buffer-occupancy to prevent packet loss from buffer's overflow/underflow (whether its occupancy is prevented to run above/below the watermark). It can tolerate diverse system behaviors to provide reliable multimedia communications and playback quality. Experiments show that BC-EDF outperforms other schedule mechanisms that don't reflect on the changes of buffer-occupancy.
منابع مشابه
Packet Scheduling for Multimedia Tra c in a Resource-Partitioned Network
We present a general purpose model and schedulability condition for supporting multiple service classes using bandwidth resource partitioning. The model supports guaranteed communication performance for real-time multimedia tra c via an Earliest Deadline First (EDF) packet transmission policy. We show how the EDF model can incorporate the e ect of multiple service classes sharing the same trans...
متن کاملModified MUF and EDF Algorithms for Overloaded Soft Real Time Systems
This paper proposes static and dynamic mechanisms by which MUF scheduling algorithm can be made more effective in overloaded soft real time systems (such as multimedia) using the concept of Random Dropping (RD) and negative laxity check. With introduction of RD, both algorithms result in higher values of DMTR as compared to without RD. Using negative laxity check and appropriate random dropping...
متن کاملDeadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the real-time disk scheduling problem to balance the trade-off between satisfying real-time constraints and minimizing the disk service time is considered. It is an interesting and practical problem for real-time storage man...
متن کاملRobustness Results for Hierarchical Diff-EDF Scheduling upon Heterogeneous Real-Time Packet Networks
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...
متن کاملHigh Utilization Guarantee for Hierarchical Diff-EDF Schedulers
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...
متن کامل